Optimizing bid search in large outcome spaces for automated multi-issue negotiations using meta-heuristic methods
نویسندگان
چکیده
منابع مشابه
optimal trajectory planning for flexible mobile manipulators under large deformation using meta-heuristic optimization methods
in present paper, a point to point optimal path is planned for a mobile manipulator with flexible links and joints. for this purpose, a perfect dynamic modeling is performed for mobile manipulators considering large deformation in links, shear effects, elastic joints, effect of gravitation, and non-holonomic constraints. to study large deformation of links, non-linear relation of displacement-s...
متن کاملEditorial for the Special Issue on Automated Design and Assessment of Heuristic Search Methods
Heuristic search algorithms have been successfully applied to solve many problems in practice. Their design, however, has increased in complexity as the number of parameters and choices for operators and algorithmic components is also expanding. There is clearly the need of providing the final user with automated tools to assist the tuning, design and assessment of heuristic optimisation method...
متن کاملSearch Methods Using Heuristic Strategies
As the metalevel problem M is no d i f f e r e n t from any other problem, the basic procedure outl i ned above, or some v a r i a t i o n of i t , can be used to generate a so l u t i on to M, and hence to P. However, in almost a l l cases we can expect the metal e v e l problem to be commutative — tha t i s , i f f o r a given s ta te there ex i s t s a number of possib le successors, and one...
متن کاملAutomated Search for Heuristic Functions
We present a metaheuristic algorithm for creating heuristic functions for CSP, especially SAT, with as low human interaction as possible. We use the concept of genetic programming to evolve local search heuristic functions encoded as a list of RAM model-like computer instructions. However, we’ve extended the RAM model language to reflect the features of genetic programming and the random mixing...
متن کاملOptimizing a multi-product closed-loop supply chain using NSGA-II, MOSA, and MOPSO meta-heuristic algorithms
This study aims to discuss the solution methodology for a closed-loop supply chain (CLSC) network that includes the collection of used products as well as distribution of the new products. This supply chain is presented on behalf of the problems that can be solved by the proposed meta-heuristic algorithms. A mathematical model is designed for a CLSC that involves three objective functions of ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Decision Science Letters
سال: 2021
ISSN: 1929-5804,1929-5812
DOI: 10.5267/j.dsl.2020.10.007